Variance Reduction Methods for Sublinear Reinforcement Learning

This work considers the problem of provably optimal reinforcement learning for (episodic) finite horizon MDPs, i.e. how an agent learns to maximize his/her (long term) reward in an uncertain environment. The main contribution is in providing a novel algorithm — Variance-reduced Upper Confidence Q-learning (vUCQ) — which enjoys a regret bound of Õ( √ HSAT +HSA), where the T is the number of time steps the agent acts in the MDP, S is the number of states, A is the number of actions, and H is the (episodic) horizon time. This is the first regret bound that is both sub-linear in the model size and asymptotically optimal. The algorithm is sub-linear in that the time to achieve -average regret (for any constant ) is O(SA), which is a number of samples that is far less than that required to learn any (non-trivial) estimate of the transition model (the transition model is specified by O(SA) parameters). The importance of sub-linear algorithms is largely the motivation for algorithms such as Q-learning and other “model free” approaches. vUCQ algorithm also enjoys minimax optimal regret in the long run, matching the Ω( √ HSAT ) lower bound. Variance-reduced Upper Confidence Q-learning (vUCQ) is a successive refinement method in which the algorithm reduces the variance in Q-value estimates and couples this estimation scheme with an upper confidence based algorithm. Technically, the coupling of both of these techniques is what leads to the algorithm enjoying both the sub-linear regret property and the (asymptotically) optimal regret.